<HTML><HEAD><TITLE>cumulative(+StartTimes, +Durations, +Resources, +Areas, ++ResourceLimit)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(ic_edge_finder3)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>cumulative(+StartTimes, +Durations, +Resources, +Areas, ++ResourceLimit)</H1>
Cumulative constraint on specified tasks.
<DL>
<DT><EM>StartTimes</EM></DT>
<DD>Collection of start times for tasks (integer variables or integers)
</DD>
<DT><EM>Durations</EM></DT>
<DD>Collection of duration for tasks (integer variables or integers)
</DD>
<DT><EM>Resources</EM></DT>
<DD>Collection of resource usages by tasks (integer variables or integers)
</DD>
<DT><EM>Areas</EM></DT>
<DD>Collection of areas covered by tasks (integer variables or integers)
</DD>
<DT><EM>ResourceLimit</EM></DT>
<DD>Maximum amount of resource available (integer)
</DD>
</DL>
<H2>Description</H2>
<P>
   In this variant, an area (the product of duration and resource usage of
   a task) can be specified, e.g. if duration or reource usage are not
   known in advance. The edge-finder algorithm can make use of this information
   to derive bound updates.
</P><P>
   Any input variables which do not already have finite bounds will be
   given default bounds of -10000000 to 10000000.
</P>

<H2>See Also</H2>
<A HREF="../../lib/ic_edge_finder3/disjunctive-2.html">disjunctive / 2</A>, <A HREF="../../lib/ic_edge_finder3/cumulative-4.html">cumulative / 4</A>, <A HREF="../../lib/lists/collection_to_list-2.html">lists : collection_to_list / 2</A>, <A HREF="../../lib/ic_edge_finder/cumulative-5.html">ic_edge_finder : cumulative / 5</A>, <A HREF="../../lib/edge_finder3/cumulative-5.html">edge_finder3 : cumulative / 5</A>, <A HREF="../../lib/edge_finder/cumulative-5.html">edge_finder : cumulative / 5</A>
</BODY></HTML>
